Unsplittable Classes of Separable Permutations
نویسندگان
چکیده
A permutation class is splittable if it is contained in the merge of two of its proper subclasses. We characterise the unsplittable subclasses of the class of separable permutations both structurally and in terms of their bases.
منابع مشابه
Equipopularity Classes in the Separable Permutations
When two patterns occur equally often in a set of permutations, we say that these patterns are equipopular. Using both structural and analytic tools, we classify the equipopular patterns in the set of separable permutations. In particular, we show that the number of equipopularity classes for length n patterns in the separable permutations is equal to the number of partitions of the integer n− 1.
متن کاملA bijection between permutations and floorplans, and its applications
A floorplan represents the relative relations between modules on an integrated circuit. Floorplans are commonly classified as slicing, mosaic, or general. Separable and Baxter permutations are classes of permutations that can be defined in terms of forbidden subsequences. It is known that the number of slicing floorplans equals the number of separable permutations and that the number of mosaic ...
متن کاملSubclasses of the Separable Permutations
The separable permutations are those that can be obtained from the trivial permutation by two operations called direct sum and skew sum. This class of permutations contains the class of stack sortable permutations,Avp231q, which are enumerated by the Catalan numbers. We prove that all subclasses of the separable permutations which do not contain Avp231q or a symmetry of this class have rational...
متن کاملThe Brownian Limit of Separable Permutations
Context of our work. Describing typical properties of permutations in a given class is a question that has received quite a lot of attention in the last few years. Most of the attention is focused on permutation classes Av(τ) for τ of size 3. See for instance the very precise description of the asymptotic shape of permutations in these classes by Miner and Pak [12], or the link between large ra...
متن کاملLongest Common Separable Pattern between Permutations
In this article, we study the problem of finding the longest common separable pattern between several permutations. We give a polynomial-time algorithm when the number of input permutations is fixed and show that the problem is NP-hard for an arbitrary number of input permutations even if these permutations are separable. On the other hand, we show that the NP-hard problem of finding the longes...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- Electr. J. Comb.
دوره 23 شماره
صفحات -
تاریخ انتشار 2016